Bus Routes
Try to solve the Bus Routes problem.
We'll cover the following
Statement#
You are given an array, routes, representing bus routes where routes[i] is a bus route that the bus repeats forever. Every route contains one or more stations. You have also been given the source station, src, and a destination station, dest. Return the minimum number of buses someone must take to travel from src to dest, or return -1 if there is no route.
Constraints:
-
routes.length -
routes[i].length -
routes[i][j] -
src,dest
Examples#
1 of 3
2 of 3
3 of 3
Understand the problem#
Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:
What is the output if the following input is given?
Bus routes = [[4, 7, 9], [6, 8, 9]]
src = 4
dest = 8
1
2
Start with a bus at station 4, and take it to station 9. Finally, take another bus from station 9 to station 8.
3
-1
Figure it out!#
We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.
Try it yourself#
Implement your solution in the following coding playground.
Solution: Graph Valid Tree
Solution: Bus Routes